Labelled Port Graph – A Formal Structure for Models and Computations
نویسندگان
چکیده
منابع مشابه
a new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولExcluding a group-labelled graph
This paper contains a first step towards extending the Graph Minors Project of Robertson and Seymour to group-labelled graphs. For a finite abelian group Γ and Γ-labelled graph G, we describe the class of Γ-labelled graphs that do not contain a minor isomorphic to G.
متن کاملGraph partitioning for scalable distributed graph computations
Inter-node communication time constitutes a significant fraction of the execution time of graph algorithms on distributed-memory systems. Global computations on large-scale sparse graphs with skewed degree distributions are particularly challenging to optimize for, as prior work shows that it is difficult to obtain balanced partitions with low edge cuts for these graphs. In this work, we attemp...
متن کاملpassivity in waiting for godot and endgame: a psychoanalytic reading
this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...
Towards a formal model for sharing and reusing ranking computations
In this paper we present our efforts towards the design of vRank. The “Vocabulary for Ranking” allows to formally materialize ranking data algorithms. We justify the need for such a vocabulary and we show potential applications in the context of Linked Data consumption.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2018
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2018.10.002